A Continuous Polling System with General Service Times
نویسندگان
چکیده
منابع مشابه
Polling with a General-Service Order Table
This paper derives exact results for a polling system such as a token bus or token ring with exhaustive service and priority polling. The results can also be used to analyze a terminal controller with a general-service order table. There are N stations in the system and the token is passed among them according to a polling table of length M (>N). Stations are given higher priority by being list...
متن کاملWaiting times in polling systems with various service disciplines
We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...
متن کاملAn exact analysis of an asymmetric polling system with mixed service discipline and general service order
This paper derives the exact mean waiting time for an asymmetric polling system with general service order and mixed service discipline. The mixed service discipline means that the service discipline of each stage (a turn in the service order sequence) for the same station can be gated or exhaustive. The gene-l-al service order denotes that each station can be polled more than once in a polling...
متن کاملA polling system whose stability region depends on the whole distribution of service times
We present an example of a single-server polling system with two queues and an adaptive service policy where the stability region depends on the expected values of all the primitives and also on a certain exponential moment of the service-time distribution in one of the queues. The latter parameter can not be determined, in general, in terms of any finite number of power moments. It follows tha...
متن کاملPolling on a Graph with General Arrival and Service Time Distribution Polling on a Graph with General Arrival and Service Time Distribution
Polling sur un graphe avec des temps d'inter-arriv ees et de services avec distributions g en erales Abstract Nous consid erons un syst eme de polling sur un graphe avec des temps d'inter-arriv ees, de services et de d eplacements du serveur qui forment des suites i.i.d. Nous pr esentons des conditions suusantes et n ecessaires de stabilit e, en utilisant une analyse de la d erive de la charge ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1992
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005580